Exchangeability and sets of desirable gambles
نویسندگان
چکیده
Sets of desirable gambles constitute a quite general type of uncertainty model with an interesting geometrical interpretation. We give a general discussion of such models and their rationality criteria. We study exchangeability assessments for them, and prove counterparts of de Finetti’s finite and infinite representation theorems. We show that the finite representation in terms of count vectors has a very nice geometrical interpretation, and that the representation in terms of frequency vectors is tied up with multivariate Bernstein (basis) polynomials. We also lay bare the relationships between the representations of updated exchangeable models, and discuss conservative inference (natural extension) under exchangeability and the extension of exchangeable sequences.
منابع مشابه
Exchangeability for sets of desirable gambles
Sets of desirable gambles constitute a quite general type of uncertainty model with an interesting geometrical interpretation. We study exchangeability assessments for such models, and prove a counterpart of de Finetti’s finite representation theorem. We show that this representation theorem has a very nice geometrical interpretation. We also lay bare the relationships between the representatio...
متن کاملInfinite Exchangeability for Sets of Desirable Gambles
Sets of desirable gambles constitute a quite general type of uncertainty model with an interesting geometrical interpretation. We study inĄnite exchangeability assessments for them, and give a counterpart of de FinettiŠs inĄnite representation theorem. We show how the inĄnite representation in terms of frequency vectors is tied up with multivariate Bernstein (basis) polynomials. We also lay bar...
متن کاملSome Remarks on Sets of Lexicographic Probabilities and Sets of Desirable Gambles
Sets of lexicographic probabilities and sets of desirable gambles share several features, despite their apparent differences. In this paper we examine properties of marginalization, conditioning and independence for sets of lexicographic probabilities and sets of desirable gambles.
متن کاملSets of Desirable Gambles and Credal Sets
Sets of desirable gambles were proposed by Walley [7] as a general theory of imprecise probability. The main reasons for this are: it is a very general model, including as particular cases most of the existing theories for imprecise probability; it has a deep and simple axiomatic justification; and mathematical definitions are natural and intuitive. However, there is still a lot of work to be d...
متن کاملA POLARITY THEORY FOR SETS OF DESIRABLE GAMBLES A polarity theory for sets of desirable gambles
Coherent sets of almost desirable gambles and credal sets are known to be equivalent models. That is, there exists a bijection between the two collections of sets preserving the usual operations, e.g. conditioning. Such a correspondence is based on the polarity theory for closed convex cones. Learning from this simple observation, in this paper we introduce a new (lexicographic) polarity theory...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Approx. Reasoning
دوره 53 شماره
صفحات -
تاریخ انتشار 2012